水电站群发电调度决策支持系统的设计与开发

简要介绍了电网水电站群发电调度决策支持系统的结构、功能和技术特点。系统基于C/S模式，其灵活、实用的图表联动功能和虚拟电站机制大大方便了系统的管理和用户的日常操作，减轻了调度人员的工作负担。优化模型考虑因素全面，可成功解决大规模水电系统的发电调度问题。同时，方案分析功能使调度员更便于对水电调度运行方案进行适当调整。     

Ansys软件在工程设计中的应用

通常人们采用《水利水电工程钢闸门设计规范DL/T5013-95》(以下简称《规范》)算法来设计船闸人字门。这种算法只能对人字门的应力进行分析,而人字门的应变及动态特性目前还没有较为有效的方法。Ansys应用于船闸人字门的静态、动态特性的分析计算,计算结果表明,将Ansys应用于船闸人字门的设计是可行的。     

An efficient algorithm for generalized SS/TDMA scheduling with satellite cluster and intersatellite links

We consider the satellite cluster scheduling problem, which is one of the most interesting problems in the satellite communication scheduling area. This problem is known to be NP-complete, and a couple of heuristic algorithms have been developed. In this paper, we suggest another algorithm for this problem which has the same computational complexity as the best existing one and provides much better solution quality. Extensive computational simulation results are reported.     

下一代网络结点软件体系结构的研究

主动网络是网络发展的趋势之一，提出了下一代网络结点的软件体系结构模型，并对该模型的模块协作关系进行了讨论。     

Time constraints set by prime contractors for their sub-contractors

The concept of pacing is described in an articulate manner which will enable readers to discuss the views put forwards. The nine major activities are divided into two types and are discussed in detail together with the methods used by the prime contractors to allocate time windows and the underlying logic employed.     

Clustering algorithms to optimize the tool handling system management in an FMS

Tool management is recognized as a critical issue in flexible manufacturing facilities management. This article addresses the issue of tool management in a flexible system installed in an avionics components factory. The system is composed of two machining centers equipped with local tool magazines of limited capacity. A tool handling system is in charge of tool movements between the tool room and the two machines. Each machine is able to perform any operation, provided that it is equipped with the suitable tool. In this kind of installation, tool allocation must be determined, and tool movements must be synchronized in order to minimize operating costs, or, equivalently, maximize the productivity of the system. We propose an approach to production planning based on a clustering algorithm, which takes into account the tool requirements of each part program in the production batch. We also propose two different heuristics for the scheduling problem. A case study was conducted on the facility mentioned above. Two conflicting objectives can be identified for this kind of production system: the reduction of tools to be shared among machines and the reduction of workload unbalance. The tests and comparison made demonstrate how the proposed procedure leads to superior results in terms of both objectives.     

炼钢-连铸-热轧一体化集成调度管理

在钢铁制造业，炼钢－连铸－热轧作为钢铁生产流程中的三大关键工序，它们之间不仅存在物流平稳和资源平衡问题，而且存在时间平衡问题。为了节省能源，缩短生产周期，国外钢铁企业已经十分关注它们的一体化管理。结合我国钢铁企业的具体情况，对炼钢－连铸－热轧一体化管理的生产工艺、技术条件、炼钢－热轧两工程之间协调技术、生产管理系统以及国外的情况进行阐述。     

Scheduling Under Common Due Date, A Single Resource and Precedence Constraints—A Dynamic Approach

This paper discusses dynamic methods for solving a class of multi-project scheduling problems in which rates of job performances are controllable and resources such as money, energy or manpower per time unit, are renewable and continuously divisible. The objective is to complete the projects as close to the common due date as possible. Two different ways of imposing sequential precedence relations between project jobs are explored by formulating two dynamic models and studying their relationships on the optimal solution. Efficient time-decomposition algorithms for finding either globally optimal schedules or lower bound guided near-optimal solutions are suggested and computationally tested.     

FET－SEED灵巧像素光开关结点的设计

采用ＦＥＴ－ＳＥＥＤ灵巧像素技术分别设计出了直接控制方式下（２，１，１）结点（或２×１结点），直接控制和嵌入控制方式下（２，２，２）结点及２×２结点，为制作这些器件提供了依据。     

Increasing processor utilization in hard-real-time systems with checkpoints

Often hard real-time systems require results that are produced on time despite the occurrence of processor failures. This paper considers a distributed system where tasks are periodic and each task occurs in multiple copies which are periodically synchronized in order to handle failures. The problem of preemptively scheduling a set of such tasks is discussed where every occurrence of a task has to be completely executed before the next occurrence of the same task. First, a static scheduling algorithm is proposed which uses periodic checkpoints to tolerate processor failures. Then, the performance of the algorithm is substancially improved employing a mixed strategy which constructs a schedule where high frequency tasks are duplicated, and low frequency tasks are periodically checkpointed. The performance of the solution proposed is evaluated in terms of the minimum achievable processor utilization due to the useful computation of the tasks. Moreover, analytical and simulation studies are used to reveal interesting trade-offs associated with the scheduling algorithm. In particular, if high frequency tasks are less than 70 percent of the total number of tasks then the mixed strategy yields a higher processor utilization than the task duplication scheme.